Ancestral Kripke Models and Nonhereditary Kripke Models for the Heyting Propositional Calculus
نویسنده
چکیده
This is a sequel to two previous papers, where it was shown that, for the Heyting propositional calculus H, we can give Kripke-style models whose accessibility relation R need not be a quasi-ordering relation, provided we have: x\=A &Vy(xRy=* y VA). From left to right, this is the heredity condition of standard Kripke models for H, but, since R need not be reflexive, the converse is not automatically satisfied. These Kripke-style models for H were called "rudimentary Kripke models". This paper introduces a kind of dual of rudimentary Kripke models, where the equivalence above is replaced by: x^A <#3y(yRx &y \=A). From right to left, this is again the usual heredity condition, but the converse, which is automatically satisfied if R is reflexive, yields a proper subclass of rudimentary Kripke models, whose members are called "ancestral Kripke models". In all that, the semantic clauses for the connectives are as in standard Kripke models for H. The propositional calculus H is strongly sound and complete with respect to ancestral Kripke models. The remainder of the paper is devoted to Kripke-style models for H where the semantic clauses for the connectives are changed so that we need not assume any of the heredity conditions above. The resulting Kripke-style models are called "nonhereditary Kripke models". These models are inspired by some particular embeddings of H into 54 and a somewhat weaker normal modal logic. With respect to a notion of quasi-ordered nonhereditary Kripke model, we can prove a certain form of strong soundness and completeness of H. With respect to another notion, where quasi-ordering is not assumed, we can only prove the ordinary soundness and completeness of H. Received November 14, 1990; revised February 18, 1991
منابع مشابه
Rudimentary Beth Models and Conditionally Rudimentary Kripke Models for the Heyting Propositional Calculus
This paper continues the investigation of rudimentary Kripke models, i.e. non-quasiordered Kripke-style models for the Heyting propositional calculus H. Three topics, which make three companion pieces of [3], are pursued. The first topic is Beth-style models for H called rudimentary Beth models. Rudimentary Kripke models may be conceived as a particular type of these models, which are analogous...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملRudimentary Kripke Models for the Intuitionistic Propositional Calculus
DoSen, K., Rudimentary Kripe models for the intuitionistic propositional calculus, Annals of Pure and Applied Logic 62 (1993) 21-49. It is shown that the intuitionistic propositional calculus is sound and complete with respect to Kripke-style models that are not quasi-ordered. These models, called rudimentary Kripke models, differ from the ordinary intuitionistic Kripke models by making fewer a...
متن کاملNormalisation by Completeness with Heyting Algebras
Usual normalization by evaluation techniques have a strong relationship with completeness with respect to Kripke structures. But Kripke structures is not the only semantics that ts intuitionistic logic: Heyting algebras are a more algebraic alternative. In this paper, we focus on this less investigated area: how completeness with respect to Heyting algebras generate a normalization algorithm fo...
متن کاملNormalization by Completeness with Heyting Algebras
Usual normalization by evaluation techniques have a strong relationship with completeness with respect to Kripke structures. But Kripke structures is not the only semantics that ts intuitionistic logic: Heyting algebras are a more algebraic alternative. In this paper, we focus on this less investigated area: how completeness with respect to Heyting algebras generate a normalization algorithm fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 32 شماره
صفحات -
تاریخ انتشار 1991